The Size of the Largest Part of Random Weighted Partitions of Large Integers
نویسنده
چکیده
A weighted partition of the positive integer n is a multiset of size n whose decomposition into a union of disjoint components (parts) satisfies the following condition: for a given sequence of non-negative numbers {bk}k≥1, a part of size k appears in exactly one of bk possible types. Assuming that a weighted partition of n is selected uniformly at random from the set of all such partitions, we study the limiting distribution of the largest part size Xn as n → ∞. Under certain fairly general assumptions on the Dirichlet generating series D(s) = ∑∞ k=1 bkk −s, s = σ + iy, G. Meinardus, Math. Z. 59(1954), 388398, has obtained the asymptotic of the total number of weighted partitions of n. We assume that Meinardus conditions hold and prove that Xn, appropriately normalized, converges weakly to a Gumbel distribution.
منابع مشابه
The Size of the Largest Part of Random Plane Partitions of Large Integers
We study the asymptotic behavior of the largest part size of a plane partition ω of the positive integer n, assuming that ω is chosen uniformly at random from the set of all such partitions. We prove that this characteristic, appropriately normalized, tends weakly, as n → ∞, to a random variable having an extreme value probability distribution with distribution function, equal to e−e −z ,−∞ < z...
متن کاملAnalysis of Some New Partition Statistics
The study of partition statistics can be said to have begun with Erdős and Lehner [3] in 1941, who studied questions concerning the normal, resp. average value over all partitions of n of quantities such as the number of parts, the number of different part sizes, and the size of the largest part. To begin with, instead of looking at parts in partitions we will look at gaps, that is, at part siz...
متن کاملA Note on Goldbach Partitions of Large Even Integers
Let Σ2n be the set of all partitions of the even integers from the interval (4, 2n], n > 2, into two odd prime parts. We show that |Σ2n| ∼ 2n2/ log n as n → ∞. We also assume that a partition is selected uniformly at random from the set Σ2n. Let 2Xn ∈ (4, 2n] be the size of this partition. We prove a limit theorem which establishes that Xn/n converges weakly to the maximum of two random variabl...
متن کاملStrong Convergence of Weighted Sums for Negatively Orthant Dependent Random Variables
We discuss in this paper the strong convergence for weighted sums of negatively orthant dependent (NOD) random variables by generalized Gaussian techniques. As a corollary, a Cesaro law of large numbers of i.i.d. random variables is extended in NOD setting by generalized Gaussian techniques.
متن کاملAsymptotic Behavior of Weighted Sums of Weakly Negative Dependent Random Variables
Let be a sequence of weakly negative dependent (denoted by, WND) random variables with common distribution function F and let be other sequence of positive random variables independent of and for some and for all . In this paper, we study the asymptotic behavior of the tail probabilities of the maximum, weighted sums, randomly weighted sums and randomly indexed weighted sums of heavy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 22 شماره
صفحات -
تاریخ انتشار 2013